Framed temporal logic programming
نویسندگان
چکیده
A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in temporal logic programming is presented. Since framing destroys monotonicity, canonical models – used to define the semantics of non-framed programs – are no longer appropriate. To deal with this, a minimal model theory is developed, using which the temporal semantics of framed programs is captured. The existence of a minimal model for a given framed program is demonstrated. A synchronous communication mechanism for concurrent programs is provided by means of the framing technique and minimal model semantics. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Social laws in alternating time: effectiveness, feasibility, and synthesis
Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent systems. First, we show that the Alternating-time Temporal Logic (atl) of Alur, Henzinger, and Kupfer...
متن کاملAnaphora resolution and reambiguation∗
Starting off from common assumptions on the relationship between ambiguity and the process of disambiguation with regard to the technique of underspecification, we argue that disambiugation may be viewed as non-monotonic in nature in certain cases involving anaphora resolution. We then go on to present a formal analysis framed in a coupling of Discourse Representation Theory and Constraint Logi...
متن کاملTemporal and Modal Logic Programming :
This paper presents a structured, annotated bibliography of extensions of logic programming based on temporal and modal logics. Temporal and modal logic programming is a new area of research, which gained momentum in the late 1980'ies. The paper discusses temporal and modal logic programming under three headings: (1) interval logic programming , (2) temporal logic programming, and (3) modal log...
متن کاملClocked Temporal Logic Programming
Clocked temporal logic programming(CTLP) is an extension of logic programming based on a clocked temporal logic(CTL). In CTL, predicates are associated with local clocks. Local clocks can be used to model multiple granularity of time, thus the resulting temporal logic programming language, called Chronolog(MC), has a stronger modeling power. This paper discusses the logical basis of the languag...
متن کاملStratified negation in temporal logic programming and the cycle-sum test
We consider stratiied negation in temporal logic programming. We demonstrate that the cycle sum test (which was initially proposed for detecting deadlocks in the context of temporal functional programming) can also be used as a syntactic stratiication test for temporal logic programming. Therefore, on the one hand we exhibit a class of temporal logic programs with negation which have a well-dee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Sci. Comput. Program.
دوره 70 شماره
صفحات -
تاریخ انتشار 2008